//
// Created by liushuai on 2021/1/21.
//

#ifndef LEETCODE_SMALLESTK_H
#define LEETCODE_SMALLESTK_H

#include <vector>
using namespace std;
int Partition(vector<int>& array,int left,int right);
vector<int> smallestK(vector<int>& arr, int k);


#endif //LEETCODE_SMALLESTK_H
